Search results for "binary [neutron star]"
showing 10 items of 544 documents
Periodic unmixing of a binary metallic vapor
2005
We report on a type of surface structuring after short pulse laser ablation of a binary alloy. We observe the emergence of a concentric ring structure with changing elemental composition. The composition changes are interpreted by condensation of the ambient ablation vapor due to stress wave excitations in the ablation spot.
Effect of mixing and spatial dimension on the glass transition
2009
We study the influence of composition changes on the glass transition of binary hard disc and hard sphere mixtures in the framework of mode coupling theory. We derive a general expression for the slope of a glass transition line. Applied to the binary mixture in the low concentration limits, this new method allows a fast prediction of some properties of the glass transition lines. The glass transition diagram we find for binary hard discs strongly resembles the random close packing diagram. Compared to 3D from previous studies, the extension of the glass regime due to mixing is much more pronounced in 2D where plasticization only sets in at larger size disparities. For small size disparitie…
CLEASE: a versatile and user-friendly implementation of cluster expansion method
2018
Materials exhibiting a substitutional disorder such as multicomponent alloys and mixed metal oxides/oxyfluorides are of great importance in many scientific and technological sectors. Disordered materials constitute an overwhelmingly large configurational space, which makes it practically impossible to be explored manually using first-principles calculations such as density functional theory due to the high computational costs. Consequently, the use of methods such as cluster expansion (CE) is vital in enhancing our understanding of the disordered materials. CE dramatically reduces the computational cost by mapping the first-principles calculation results on to a Hamiltonian which is much fa…
Skeletizing 3D-Objects by Projections
2004
Skeletization is used to simplify an object and to give an idea of the global shape of an object. This paper concerns the continuous domain. While many methods already exist, they are mostly applied in 2D-space. We present a new method to skeletize the polygonal approximation of a 3D-object, based on projections and 2D-skeletization from binary trees.
Algorithms for Rational Discrete Least Squares Approximation Part I: Unconstrained Optimization
1976
In this paper a modification of L. Wittmeyer’s method ([1], [14]) for rational discrete least squares approximation is given which corrects for its failure to converge to a non-optimal point in general. The modification makes necessary very little additional computing effort only. It is analysed thoroughly with respect to its conditions for convergence and its numerical properties. A suitable implementation is shown to be benign in the sense of F. L. Bauer [2]. The algorithm has proven successful even in adverse situations.
Solving a continuous periodic review inventory-location allocation problem in vendor-buyer supply chain under uncertainty
2019
In this work, a mixed-integer binary non-linear two-echelon inventory problem is formulated for a vendor-buyer supply chain network in which lead times are constant and the demands of buyers follow a normal distribution. In this formulation, the problem is a combination of an (r, Q) and periodic review policies based on which an order of size Q is placed by a buyer in each fixed period once his/her on hand inventory reaches the reorder point r in that period. The constraints are the vendors’ warehouse spaces, production restrictions, and total budget. The aim is to find the optimal order quantities of the buyers placed for each vendor in each period alongside the optimal placement of the ve…
An Island Strategy for Memetic Discrete Tomography Reconstruction
2014
In this paper we present a parallel island model memetic algorithm for binary discrete tomography reconstruction that uses only four projections without any further a priori information. The underlying combination strategy consists in separated populations of agents that evolve by means of different processes. Agents progress towards a possible solution by using genetic operators, switch and a particular compactness operator. A guided migration scheme is applied to select suitable migrants by considering both their own and their sub-population fitness. That is, from time to time, we allow some individuals to transfer to different subpopulations. The benefits of this paradigm were tested in …
An experimental study of the stability problem in discrete tomography
2003
This paper introduces the topic of discrete tomography, briefly showing its main applications, algorithms and new prospects of research. It focuses on the still open problem of stability, facing it from an experimental point of view. In particular an extensive simulation lets verify the robustness of a well known reconstruction technique for binary convex objects, calculating the probability of finding solutions compatible with a given set of noisy projections. © 2005 Elsevier Ltd. All rights reserved.
A hybrid genetic algorithm with local search: I. Discrete variables: optimisation of complementary mobile phases
2001
Abstract A hybrid genetic algorithm was developed for a combinatorial optimisation problem. The assayed hybridation modifies the reproduction pattern of the genetic algorithm through the application of a local search method, which enhances each individual in each generation. The method is applied to the optimisation of the mobile phase composition in liquid chromatography, using two or more mobile phases of complementary behaviour. Each of these phases concerns the optimal separation of certain compounds in the analysed mixture, while the others can remain overlapped. This optimisation approach may be useful in situations where full resolution with a single mobile phase is unfeasible. The o…
Integral binary Hamiltonian forms and their waterworlds
2018
We give a graphical theory of integral indefinite binary Hamiltonian forms $f$ analogous to the one by Conway for binary quadratic forms and the one of Bestvina-Savin for binary Hermitian forms. Given a maximal order $\mathcal O$ in a definite quaternion algebra over $\mathbb Q$, we define the waterworld of $f$, analogous to Conway's river and Bestvina-Savin's ocean, and use it to give a combinatorial description of the values of $f$ on $\mathcal O\times\mathcal O$. We use an appropriate normalisation of Busemann distances to the cusps (with an algebraic description given in an independent appendix), and the $\operatorname{SL}_2(\mathcal O)$-equivariant Ford-Voronoi cellulation of the real …